Gaussian Fluctuations of Representations of Wreath Products
نویسنده
چکیده
We study the asymptotics of the reducible representations of the wreath productsG≀Sq = G⋊Sq for large q, whereG is a fixed finite group and Sq is the symmetric group in q elements; in particular for G = Z/2Z we recover the hyperoctahedral groups. We decompose such a reducible representation of G ≀ Sq as a sum of irreducible components (or, equivalently, as a collection of tuples of Young diagrams) and we ask what is the character of a randomly chosen component (or, what are the shapes of Young diagrams in a randomly chosen tuple). Our main result is that for a large class of representations the fluctuations of characters (and fluctuations of the shape of the Young diagrams) are asymptotically Gaussian. The considered class consists of the representations for which the characters asymptotically almost factorize and it includes, among others, the left regular representation therefore we prove the analogue of Kerov’s central limit theorem for wreath products.
منابع مشابه
Cayley Automatic Representations of Wreath Products
We construct the representations of Cayley graphs of wreath products using finite automata, pushdown automata and nested stack automata. These representations are in accordance with the notion of Cayley automatic groups introduced by Kharlampovich, Khoussainov and Miasnikov and its extensions introduced by Elder and Taback. We obtain the upper and lower bounds for a length of an element of a wr...
متن کاملA SOLOMON DESCENT THEORY FOR THE WREATH PRODUCTS G Sn
We propose an analogue of Solomon’s descent theory for the case of a wreath product G Sn, where G is a finite abelian group. Our construction mixes a number of ingredients: Mantaci-Reutenauer algebras, Specht’s theory for the representations of wreath products, Okada’s extension to wreath products of the Robinson-Schensted correspondence, and Poirier’s quasisymmetric functions. We insist on the...
متن کاملRestricted cascade and wreath products of fuzzy finite switchboard state machines
A finite switchboard state machine is a specialized finite state machine. It is built by binding the concepts of switching state machines and commutative state machines. The main purpose of this paper is to give a specific algorithm for fuzzy finite switchboard state machine and also, investigates the concepts of switching relation, covering, restricted cascade products and wreath products of f...
متن کاملWREATH PRODUCTS AND REPRESENTATIONS OF p-LOCAL FINITE GROUPS
Given two finite p-local finite groups and a fusion preserving morphism between their Sylow subgroups, we study the question of extending it to a continuous map between the classifying spaces. The results depend on the construction of the wreath product of p-local finite groups which is also used to study p-local permutation representations.
متن کاملMass formulas for local Galois representations to wreath products and cross products
Bhargava proved a formula for counting, with certain weights, degree n étale extensions of a local field, or equivalently, local Galois representations to Sn. This formula is motivation for his conjectures about the density of discriminants of Sn-number fields. We prove there are analogous “mass formulas” that count local Galois representations to any group that can be formed from symmetric gro...
متن کامل